On-Line Case-Based Policy Learning for Automated Planning in Probabilistic Environments
نویسندگان
چکیده
منابع مشابه
On-Line Case-Based Planning
Some domains, such as real-time strategy (RTS) games, pose several challenges to traditional planning and machine learning techniques. In this paper, we present a novel on-line case-based planning architecture that addresses some of these problems. Our architecture addresses issues of plan acquisition, on-line plan execution, interleaved planning and execution and on-line plan adaptation. We al...
متن کاملImproving Determinization in Hindsight for On-line Probabilistic Planning
Recently, ‘determinization in hindsight’ has enjoyed surprising success in on-line probabilistic planning. This technique evaluates the actions available in the current state by using non-probabilistic planning in deterministic approximations of the original domain. Although the approach has proven itself effective in many challenging domains, it is computationally very expensive. In this paper...
متن کاملLTL-based Planning in Environments with Probabilistic Observations ∗ -draft-
This research proposes a centralized method for planning and monitoring the motion of one or a few mobile robots in an environment where regions of interest appear and disappear based on exponential probability density functions. The motion task is given as a linear temporal logic formula over the set of regions of interest. The solution determines robotic trajectories and updates them whenever...
متن کاملOn-line Path Planning for Mobile Robots in Dynamic Environments
Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...
متن کاملAn on-line algorithm for dynamic reinforcement learning and planning in reactive environments
An on line learning algorithm for reinforcement learning with continually running recur rent networks in non stationary reactive environments is described Various kinds of rein forcement are considered as special types of input to an agent living in the environment The agent s only goal is to maximize the amount of reinforcement received over time Supervised learning techniques for recurrent ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology & Decision Making
سال: 2018
ISSN: 0219-6220,1793-6845
DOI: 10.1142/s0219622018500086